Adaptive Routing on Transputer Networks with Torus 2-d Topology
نویسندگان
چکیده
Second generation multicomputers use wormhole routing, allowing a very low channel setup time and drastically reducing the dependency between network latency and internode distance. The network routing can be deterministic or adaptive. In this paper, we present the development and implementation of a fully adaptive routing algorithm. Our work is carried out in a multicomputer with the C104 routers and the T9000 transputers. We describe several implementation details and give some simulation results. These results show the performance improvement that can be achieved using fully adaptive routing. Our simulations have been carried out on a torus 2-D topology.
منابع مشابه
Intuitionistic fuzzy logic for adaptive energy efficient routing in mobile ad-hoc networks
In recent years, mobile ad-hoc networks have been used widely due to advances in wireless technology. These networks are formed in any environment that is needed without a fixed infrastructure or centralized management. Mobile ad-hoc networks have some characteristics and advantages such as wireless medium access, multi-hop routing, low cost development, dynamic topology and etc. In these netwo...
متن کاملMassively parallel machine based on T 9000 and C 104
The T9000 transputer and its companion routing chip, the C104, allow the construction of very large networks (several thousand processors). The designer of such a network must select a topology taking into account both performance (i.e. small communication delays) and engineering considerations (cost and wireability). This paper presents preliminary studies of various candidate topologies for l...
متن کاملPerformance Evaluation of Fully Adaptive Routing for the Torus Interconnect Networks
Adaptive routing algorithms have been frequently suggested as a means of improving communication performance in parallel computer networks. These algorithms, unlike deterministic routing, can utilize network state information to exploit the presence of multiple paths. Before such schemes can be successfully incorporated in networks, it is necessary to have a clear understanding of the factors w...
متن کاملAn adaptive deadlock and livelock free routing algorithm
This paper is concerned with Store and Forward deadlocks (DL) arising in interprocessor network systems with buffered packet switched communications. Algorithms which implement DL free routing use adaptive or not adaptive routing modality. Not adaptive algorithms underuse the interconnection network bandwidth because they impose restrictions to the routing paths; adaptive algorithms are DL free...
متن کاملMulti-Dimensional Interval Routing Schemes
Interval Routing Scheme (k-IRS) is a compact routing scheme on general networks. It has been studied extensively and recently been implemented on the latest generation INMOS Transputer Router chip. In this paper we introduce an extension of the Interval Routing Scheme k-IRS to the multi-dimensional case hk; di-MIRS, where k is the number of intervals and d is the number of dimensions. Whereas k...
متن کامل